The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields
نویسندگان
چکیده
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Three measures of trellis complexity are considered: the total number of states, the total number of edges, and the maximum state complexity of the trellis. The problem is proven NP-hard for all three measures, provided the eld over which the code is speciied is not xed. We leave open the problem of dealing with the case of a xed eld, in particular GF (2).
منابع مشابه
On constructing trellis codes with large free distances and low decoding complexities
We propose a trellis-coding scheme for which large free distances and low decoding complexities can be easily achieved. The proposed trellis-coding scheme is a generalization of the trellis-coding scheme proposed by Hellstern. With the proposed trellis-coding scheme, we have the flexibility of controlling the decoding delay.
متن کاملThe "Art of Trellis Decoding" Is NP-Hard
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C ′ whose minimal trellis has the least state-complexity among all codes obtainable by permuting the coordinates of C. By reducing from the problem of computing the pathwidth of a graph, we show that the problem of finding such a coordinate permutation is NP-hard, thus ...
متن کاملAll-Analog Decoder for a Binary (18,9,5) Tail-Biting Trellis Code
An all-analog high-speed decoding technique is described which is suitable for magnetic recording (MR) and other computationally demanding applications. A decoder for a binary (18,9,5) tail-biting trellis code, which is much simpler than the codes used for MR, has been chosen to demonstrate this technique. It achieves a decoding rate of 100 Mbit/s at a single 5V power supply. The power consumpt...
متن کاملOn the design and maximum-likelihood decoding of space-time trellis codes
In this letter, we present a simple generalization of the maximum ratio combining principle for space–time coded systems. This result leads to a maximum-likelihood decoder implementation that does not depend on the number of receive antennas and avoids the loss in performance incurred in the decoders proposed by Tarokh and Lo and Biglieri et al. The insights offered by this decoding rule allow ...
متن کاملEarly Detection and Trellis Splicing Reduced Complexity Soft Iterative Decoding
The excellent bit error rate performance of new soft iter ative decoding algorithms eg turbo codes is achieved at the expense of a computationally burdensome itera tive decoding procedure In this paper we present a new method called early detection that can be used to reduce the computational complexity of a variety of soft iterative decoding methods Using a con dence criterion some in formatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998